package problem96;

//96.不同的二叉搜索树
//https://leetcode.cn/problems/unique-binary-search-trees/

class Solution {
    public int numTrees(int n) {
        int[] dp = new int[n+1];
        dp[0] = 1;
        for(int i = 1; i<=n; i++) {
            for(int j = 1; j<=i; j++) {
                dp[i] += dp[j-1] * dp[i-j];
            }
        }
        return dp[n];
    }
}

/*
dp[i]: 当节点个数为i的时候有多少种不同的二叉搜索树

*/